Ant Colony Optimization Applied to Minimum Weight Dominating Set Problem
نویسندگان
چکیده
In this paper we present an application of ant colony optimization (ACO) to the Minimum Weighted Dominating Set Problem. We introduce a heuristic for this problem that takes into account the weights of vertexes being covered and show that it is more efficient than the greedy algorithm using the standard heuristic. Further we give implementation details of ACO applied to this problem. We tested our algorithm on graphs with different sizes, edge densities, and weight distribution functions and shown that it gives greatly improved results over these acquired by the greedy algorithms. Key-Words: Ant Colony Optimization, Dominating Set Problem, Optimization Problems, Population Based Algorithms
منابع مشابه
An Order-based Algorithm for Minimum Dominating Set with Application in Graph Mining
Dominating set is a set of vertices of a graph such that all other vertices have a neighbour in the dominating set. We propose a new order-based randomised local search (RLSo) algorithm to solve minimum dominating set problem in large graphs. Experimental evaluation is presented for multiple types of problem instances. These instances include unit disk graphs, which represent a model of wireles...
متن کاملAn Analysis of Different Variations of Ant Colony Optimization to the Minimum Weight Vertex Cover Problem
Ant colony optimization (ACO) has previously been applied to the Minimum Weight Vertex Cover Problem with very good results. The performance of the ACO algorithm can be improved with the use of different variations of the basic Ant Colony System algorithm, like the use of Elitism, Rank based approach and the MinMax system. In this paper, we have made an analysis of effectiveness of these variat...
متن کاملAnalysis of Parallel Implementations of the Ant Colony Optimization Applied to the Minimum Weight Vertex Cover Problem
In this paper we analyze various parallel implementations of the Ant Colony Optimization (ACO) applied to the Minimum Weight Vertex Cover Problem (MWVCP). We investigated the ACO algorithms applied to the MWCVP before. Here, we observe the behavior of different parallel topologies and corresponding algorithms like fully connected, replace worst, ring and independent parallel runs. We also prese...
متن کاملAnt colony optimization algorithm with pheromone correction strategy for the minimum connected dominating set problem
In this paper an ant colony optimization (ACO) algorithm for the minimum connected dominating set problem (MCDSP) is presented. The MCDSP become increasingly important in recent years due to its applicability to the mobile ad hoc networks (MANETs) and sensor grids. We have implemented a one-step ACO algorithm based on a known simple greedy algorithm that has a significant drawback of being easi...
متن کاملComparison of Different Topologies for Island-Based Multi-Colony Ant Algorithms for the Minimum Weight Vertex Cover Problem
The aim of this paper is compare the effect of using different topologies or connections between separate colonies in island based parallel implementations of the Ant Colony Optimization applied to the Minimum Weight Vertex Cover Problem. We investigated the sequential Ant Colony Optimization algorithms applied to the Minimum Weight Vertex Cover Problem before. Parallelization of population bas...
متن کامل